Quality guaranteed all-hex mesh generation by a constrained volume iterative fitting algorithm
نویسندگان
چکیده
The hexahedral mesh (hex mesh) is usually preferred to the tetrahedral mesh (tet mesh) in finite element methods for numerical simulation. In finite element analysis, a valid hex mesh requires that the scaled Jacobian value at each mesh vertex is larger than 0. However, the hex mesh produced by lots of prevailing hex mesh generation methods cannot be guaranteed to be a valid hex mesh. In this paper, we develop a constrained volume iterative fitting (CVIF) algorithm to fill a given triangular mesh model with an all-hex volume mesh. Starting from an initial all-hex mesh model, which is generated by voxelizing the given triangular mesh model, CVIF algorithm fits the boundary mesh of the initial all-hex mesh to the given triangular mesh model by iteratively adjusting the boundary mesh vertices. In each iteration, the movements of the boundary mesh vertices are diffused to the inner all-hex mesh vertices. After the iteration stops, an all-hex volume mesh that fills the given triangular mesh model can be generated. In the CVIF algorithm, the movement of each all-hex mesh vertex is constrained to ensure that the scaled Jacobian value at eachmesh vertex is larger than 0, etc. Therefore, the all-hexmesh generated by the CVIF algorithm is guaranteed to be a valid all-hex mesh. © 2015 Elsevier Ltd. All rights reserved.
منابع مشابه
Filling Triangular Mesh Model with All-Hex Mesh by Volume Subdivision Fitting
The hexahedral mesh (hex mesh) is preferred to the tetrahedral mesh (tet mesh) in finite element methods for numerical simulation. However, generating a hex mesh with desirable qualities often requires significant geometric decomposition and considerable user interactions. Therefore, this process may require days or even weeks in the case of complex shapes. In this paper, we develop a method ba...
متن کاملHex-dominant mesh generation using 3D constrained triangulation
A method for decomposing a volume with a prescribed quadrilateral surface mesh, into a hexahedral-dominated mesh is proposed. With this method, known as Hex-kforphing (HMorph), an initial tetrahedral mesh is provided. Tetrahedral are transformed and combined starting from the boundary and working towards the interior of the volume. The quadrilateral faces of the hexahedra are treated as interna...
متن کاملConstrained Triangulation: Application to Hex-Dominant Mesh Generation
Boundary-constrained triangulation has long been the domain of Delaunay mesh generation. Another application for constrained triangulation is introduced in this work. A new technique for hexahedral-dominant mesh generation is developed. With this method, known as Hex-Morphing (H-Morph), an initial tetrahedral mesh is provided. The quadrilateral faces of the hexahedra are treated as internal sur...
متن کاملAdaptive All-Hexahedral Mesh Generation Based on A Hybrid Octree and Bubble Packing
In this paper, a novel adaptive all-hexahedral (all-hex) mesh generation algorithm is proposed based on a hybrid octree. This hybrid octree consists of polyhedral cells and each grid point is always shared by eight cells by using a cutting procedure. A dual mesh with all-hex elements is then extracted by analyzing each grid point. Next, sphere or ellipsoid bubble packing is applied to improve t...
متن کاملSurvey on Geometric Iterative Methods with Applications
Geometric iterative method, also called progressive-iterative approximation (PIA), is an iterative method with clear geometric meaning. Just by adjusting the control points of curves or surfaces iteratively, the limit curve or surface will interpolate (approximate) the given data point set. In this paper, we introduce the geometric iterative method in two aspects, i.e., theory and application. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer-Aided Design
دوره 67-68 شماره
صفحات -
تاریخ انتشار 2015